Robust estimation of sparse precision matrix using adaptive weighted graphical lasso approach
نویسندگان
چکیده
Estimation of a precision matrix (i.e. inverse covariance matrix) is widely used to exploit conditional independence among continuous variables. The influence abnormal observations exacerbated in high dimensional setting as the dimensionality increases. In this work, we propose robust estimation based on an l1 regularised objective function with weighted sample matrix. robustness proposed can be justified by nonparametric technique integrated squared error criterion. To address non-convexity function, develop efficient algorithm similar spirit majorisation-minimisation. Asymptotic consistency estimator also established. performance method compared several existing approaches via numerical simulations. We further demonstrate merits application genetic network inference.
منابع مشابه
Sparse Precision Matrix Estimation via Lasso Penalized D-Trace Loss
We introduce a constrained empirical loss minimization framework for estimating highdimensional sparse precision matrices and propose a new loss function, called the D-trace loss, for that purpose. A novel sparse precision matrix estimator is defined as the minimizer of the lasso penalized D-trace loss under a positive-definiteness constraint. Under a new irrepresentability condition, the lasso...
متن کاملSparse inverse covariance estimation with the graphical lasso.
We consider the problem of estimating sparse graphs by a lasso penalty applied to the inverse covariance matrix. Using a coordinate descent procedure for the lasso, we develop a simple algorithm--the graphical lasso--that is remarkably fast: It solves a 1000-node problem ( approximately 500,000 parameters) in at most a minute and is 30-4000 times faster than competing methods. It also provides ...
متن کاملA Constrained 1 Minimization Approach to Sparse Precision Matrix Estimation
This article proposes a constrained 1 minimization method for estimating a sparse inverse covariance matrix based on a sample of n iid p-variate random variables. The resulting estimator is shown to have a number of desirable properties. In particular, the rate of convergence between the estimator and the true s-sparse precision matrix under the spectral norm is s √ log p/n when the population ...
متن کاملBayesian estimation of a sparse precision matrix
We consider the problem of estimating a sparse precision matrix of a multivariate Gaussian distribution, including the case where the dimension p is large. Gaussian graphical models provide an important tool in describing conditional independence through presence or absence of the edges in the underlying graph. A popular non-Bayesian method of estimating a graphical structure is given by the gr...
متن کاملApplications of the lasso and grouped lasso to the estimation of sparse graphical models
We propose several methods for estimating edge-sparse and nodesparse graphical models based on lasso and grouped lasso penalties. We develop efficient algorithms for fitting these models when the numbers of nodes and potential edges are large. We compare them to competing methods including the graphical lasso and SPACE (Peng, Wang, Zhou & Zhu 2008). Surprisingly, we find that for edge selection...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nonparametric Statistics
سال: 2021
ISSN: ['1029-0311', '1026-7654', '1048-5252']
DOI: https://doi.org/10.1080/10485252.2021.1931688